The Shortest Path Problem and Its Critical Edge in Uncertain Environment
نویسندگان
چکیده
منابع مشابه
Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra algorithm is proposed to handle SPP in an uncertain environment. Two key issues need to be addressed in SPP with fuzzy parameters. One is how to determine the addition of two edges. The other is how to compare the distance between two different paths with vailable online ...
متن کاملShortest path problem of uncertain random network
The shortest path problem is one of the most fundamental problems in network optimization. This paper is concerned with shortest path problems in non-deterministic environment, in which the lengths of some arcs have stochastic characteristics and meanwhile some have uncertain characteristics. In order to investigate paths in these networks, this paper introduces the chance distribution of minim...
متن کاملStochastic Shortest Path Problem with Uncertain Delays
This paper considers a stochastic version of the shortest path problem, the Stochastic Shortest Path Problem with Delay Excess Penalty on directed, acyclic graphs. In this model, the arc costs are deterministic, while each arc has a random delay, assumed normally distributed. A penalty occurs when the given delay constraint is not satisfied. The objective is to minimize the sum of the path cost...
متن کاملFuzzy Shortest-Path Network Problems With Uncertain Edge Weights
This paper presents two new types of fuzzy shortest-path network problems. We consider the edge weight of the network as uncertain, which means that it is either imprecise or unknown. Thus, the first type of fuzzy shortest-path problem uses triangular fuzzy numbers for the imprecise problem. The second type uses level (1 − β, 1 − α) interval-valued fuzzy numbers, which are based on past statist...
متن کاملAn Inverse Shortest Path Problem on an Uncertain Graph
The inverse shortest path problem is to minimize the modification on the edge weights such that a predetermined path becomes the shortest one from the origin to the destination with respect to the new edge weights. In this paper, the inverse shortest path problem is considered on a graph with uncertain edge weights. It is shown that the model of the uncertain inverse shortest path problem can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2948958